An Improved Nondominated Sorting Algorithm
نویسنده
چکیده
This paper presents a new procedure for the nondominated sorting with constraint handling to be used in a multiobjective evolutionary algorithm. The strategy uses a sorting algorithm and binary search to classify the solutions in the correct level of the Pareto front. In a problem with m objective functions, using n solutions in the population, the original nondominated sorting algorithm, used by NSGA-II, has always a computational cost of O mn ( ) 2 in a naïve implementation. The complexity of the new algorithm can vary from
منابع مشابه
Optimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II
The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...
متن کاملAn Improved Nondominated Sorting Multiobjective Genetic Algorithm and Its Application
The nondominated sorting genetic algorithm with elitism (NSGA-II) is widely used due to its good performance on solving multiobjective optimization problems. In each iteration of NSGA-II, truncation selection is performed based on the rank and crowding distance of each solution. There are, however, drawbacks in this process. These drawbacks to some extent cause overlapping solutions in the popu...
متن کاملA PDE-based Approach to Nondominated Sorting
Nondominated sorting is a fundamental combinatorial problem in multiobjective optimization and is equivalent to the longest chain problem in combinatorics and random growth models for crystals in materials science. In a previous work [SIAM J. Math. Anal., 46 (2014), pp. 603–638], we showed that nondominated sorting has a continuum limit that corresponds to solving a Hamilton–Jacobi equation. In...
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملIsothermal Reactor Network Synthesis Using Coupled NonDominated Sorting Genetic Algorithm-II (NSGAII) with Quasi Linear Programming (LP) Method
In this study a new and robust procedure is presented to solve synthesis of isothermal reactor networks (RNs) which considers more than one objective function. This <span style="font-size: 9pt; color: #0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJNCR
دوره 3 شماره
صفحات -
تاریخ انتشار 2012